Counterexamples to a Problem of P olya and to a Problem of Karlin
نویسنده
چکیده
Simple counterexamples to two open problems, due to PP olya and to Karlin, discussed very recently in 4], are given.
منابع مشابه
A Problem of P olya Concerning Polynomials Which Obey Descartes ' Rule of Signs
We formulate and duscuss two open problems. The rst one is due to PP olya. It states that the sequence of polynomials formed by a polynomial p with only real zeros and all its derivatives, obeys Descartes' rule of signs for any x, greater than the largest zero of p. The other problem is due to Karlin and states that certain Hankel determinants associated with an entire function in the Laguerre-...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملCOUNTEREXAMPLES IN CHAOTIC GENERALIZED SHIFTS
In the following text for arbitrary $X$ with at least two elements, nonempty countable set $Gamma$ we make a comparative study on the collection of generalized shift dynamical systems like $(X^Gamma,sigma_varphi)$ where $varphi:GammatoGamma$ is an arbitrary self-map. We pay attention to sub-systems and combinations of generalized shifts with counterexamples regarding Devaney, exact Dev...
متن کاملGenetic Algorithm-Based Optimization Approach for an Uncapacitated Single Allocation P-hub Center Problem with more realistic cost structure
A p-hub center network design problem is definition of some nodes as hubs and allocation of non-hub nodes to them wherein the maximum travel times between any pair of nodes is minimized. The distinctive feature of this study is proposing a new mathematical formulation for modeling costs in a p-hub center problem. Here, instead of considering costs as a linear function of distance, for the first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998